A26 - Prime Check

提出

code: python

q = int(input())

print(x)

# エラトステネスの篩

解答

code: python

q = int(input())

def isPrime(n):

for i in range(2, int(n ** 0.5) + 1):

if n % i == 0:

return False

return True

for i in range(q):

if Answer == True:

print("Yes")

else:

print("No")